翻訳と辞書 |
Feige–Fiat–Shamir identification scheme : ウィキペディア英語版 | Feige–Fiat–Shamir identification scheme
In cryptography, the Feige–Fiat–Shamir identification scheme is a type of parallel zero-knowledge proof developed by Uriel Feige, Amos Fiat, and Adi Shamir in 1988. Like all zero-knowledge proofs, it allows one party, Peggy, to prove to another party, Victor, that she possesses secret information without revealing to Victor what that secret information is. The Feige–Fiat–Shamir identification scheme, however, uses modular arithmetic and a parallel verification process that limits the number of communications between Peggy and Victor. == Setup == Choose two large prime integers ''p'' and ''q'' and compute the product ''n = pq''. Create secret numbers with gcd(,) = 1. Compute . Peggy and Victor both receive while and are kept secret. Peggy is then sent the numbers . These are her secret login numbers. Victor is sent the numbers by Peggy when she wishes to identify herself to Victor. Victor is unable to recover Peggy's numbers from his numbers due to the difficulty in determining a modular square root when the modulus' factorization is unknown.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Feige–Fiat–Shamir identification scheme」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|